Shortest Paths Through Pseudo-Random Points in the d-Cube
نویسندگان
چکیده
منابع مشابه
Shortest Path through Random Points
Let (M, g1) be a compact d-dimensional Riemannian manifold. Let Xn be a set of n sample points in M drawn randomly from a Lebesgue density f . Define two points x, y ∈ M . We prove that the normalized length of the power-weighted shortest path between x, y passing through Xn converges to the Riemannian distance between x, y under the metric gp = f g1, where p > 1 is the power parameter. The res...
متن کاملBounded-Curvature Shortest Paths through a Sequence of Points
We consider the problem of computing shortest paths, whose curvature is constrained to beat most one almost everywhere, and that visit a sequence of n points in the plane in a givenorder. This problem arises naturally in path planning for point car-like robots in the presenceof polygonal obstacles, and is also a sub-problem of the Dubins Traveling Salesman Problem.We show that, ...
متن کاملPairwise edge disjoint shortest paths in the n-cube
Complexity issues intrinsic to certain fundamental data dissemination problems in high-performance network topologies are discussed. In particular, we study the p-pairwise edge disjoint shortest paths problem.An efficient algorithm for the case when every source point is at a distance at most two from its target is presented and for pairs at a distance at most three we show that the problem is ...
متن کاملGraph Embedding through Random Walk for Shortest Paths Problems
We present a new probabilistic technique of embedding graphs in Z, the d-dimensional integer lattice, in order to find the shortest paths and shortest distances between pairs of nodes. In our method the nodes of a breath first search (BFS) tree, starting at a particular node, are labeled as the sites found by a branching random walk on Z. After describing a greedy algorithm for routing (distanc...
متن کاملEuclidean Shortest Paths in Simple Cube Curves at a Glance
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary accuracy, defined by ε > 0, and in time complexity κ(ε) · O(n), where κ(ε) is the length difference between the path used for initialization and the minimumlength path, divided by ε. A run-time diagram also illustrates...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1980
ISSN: 0002-9939
DOI: 10.2307/2042159